滚装船冷却水系统的优化设计与热力性能研究

本文以12300t滚装船为母体,运用非线性规划理论对独立式和混合式两套冷却水系统进行了优化计算和分析,并对其冷却水系统的冷却效果和经济性进行了评估.同时还对其多主机双套冷却水系统进行了热力性能研究,对其在系统额定热负荷下和变负荷下的热力特性进行了分析计算,通过计算定量地揭示出其冷却系统的节能潜力.上述分析和研究为今后用以指导冷却系统的运行管理,以及为系统节能降耗提供了科学而准确的依据.     

载人潜水器耐压球壳的多目标优化设计

采用基于响应面(RSM)近似模型和遗传算法(GA)对某深海载人潜水器耐压球壳进行多目标优化设计。首先建立深海载人潜水器耐压球壳的结构优化模型,通过试验设计(DOE)获得设计目标的响应特性,拟合得到响应面近似模型,最后采用Pareto遗传算法对响应面模型进行多目标优化求解,得到潜水器耐压球壳的优化设计方案。     

智能汽车自动紧急转向避撞的跟踪控制方法对比研究

为了提高智能汽车的主动安全性,提出3种不同的自动紧急转向避撞跟踪控制方法。首先建立汽车避撞简化模型,对制动、转向及两者相结合的3种不同避撞方式进行对比分析。其次,为深入研究汽车避撞过程中的实际响应,建立包含转向、制动及悬架3个子系统耦合特性的底盘18自由度统一动力学模型,并进行相关试验验证。随后构建智能汽车自动紧急转向避撞控制框架,对五次多项式参考路径和七次多项式参考路径的横摆角速度和横摆角加速度进行对比分析。接着以线性2自由度转向动力学模型为参考对象,对最优控制四轮转向、最优控制前轮转向、前馈与反馈控制相结合的前轮转向3种不同的跟踪控制系统分别进行设计。最后,以汽车底盘18自由度统一动力学模型为研究对象,对上述3种避撞控制系统进行仿真试验对比分析。研究结果表明：与制动避撞相比而言,转向避撞所需的纵向距离有较大降低,随着车速的增加和路面附着系数的越低,效果越明显;七次多项式参考路径比五次多项式参考路径的避撞过渡过程更为平缓,当实际车速与控制器所用车速不一致时,前者避撞性能表现更优;最优四轮转向控制系统在高、低2种不同附着路面都具有较好的避撞效果,最优前轮转向控制系统次之,而前馈与反馈相结合的前轮转向控制系统在低附着路面上则表现出严重的失稳。     

铁路接触网最优主动控制研究

研究目的:本文为研究主动控制对接触网性能的影响,建立了接触网有限元模型,应用Ansys软件计算模型的整体质量及刚度矩阵数据,并利用KMExtract程序分离出整体质量、整体刚度矩阵,据此建立接触网系统动力学方程。为便于系统仿真及控制器设计,使用模态降阶法对系统降阶并将其转化为状态方程形式,而后为系统设计LQR控制器,使用simulink对实施主动控制前后的接触网系统进行动态仿真分析。研究结论:研究表明:(1)对接触网实施主动控制能有效改善其振动特性,接触网振动的最大值、最小值有较大降低,幅度达90%以上,均方差也有较大下降,幅度达70%以上,系统性能得到了极大提升。(2)在通过改变弓网自身参数的方法改善弓网性能遇到瓶颈时,接触网的主动控制或半主动控制将成为改善弓网性能的重要手段。     

基于灰色评价理论的自适应最优路径选择

充分考虑了驾驶员在路径选择中的不同要求,依据层次分析法和灰色评价理论建立了一种根据驾驶员的偏好自适应选择最优路径的方法,并设计了相应的决策支持系统,为智能交通流诱导系统的进一步发展铺平了道路。     

连续刚构桥双薄壁墩参数优化研究

考虑侧向风压产生扭转及温度变化产生纵向变形的作用，通过对双薄壁墩连续刚构桥的受力分析，探讨了双薄壁墩设计的影响因素，以非线性规划为基础，应用罚函数法对双薄壁墩参数进行优化研究。     

Methods to reduce dimensionality and identify candidate solutions in multi-objective signal timing problems

Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.     

考虑拥挤的轨道交通网络时刻表协调优化建模

以非连通型城市轨道交通网络为研究对象,根据城市轨道交通网络周期性运行特点,在深入考虑拥挤及换乘客流脉冲性到达特征的前提下,给出1个循环周期内城市轨道交通网络运营费用及乘客出行费用计算方法.并在此基础上,以各运营线路发车间隔及发车时刻相位差为决策变量,以乘客及运营企业的综合费用最小为目标,以列车发车间隔、列车容量、站台容量、运营补贴等为约束,建立城市轨道交通网络列车时刻表优化模型.根据模型特点,提出了一种基于仿真的遗传算法对模型进行求解.算例结果显示,与既有优化方法相比,本文模型能够更加细致地刻画乘客换乘过程,有效降低系统综合费用,并确保各项服务指标在安全范围之内.     

基于LQR限宽水域中KVLCC2操纵运动控制研究

在航道宽度受限制的水域中,船舶会受到岸壁效应的影响,横向力与首摇力矩将发生变化,这会对船舶的航行安全产生不利的影响.鉴于此问题,本文应用现代控制理论最优控制LQR方法,对在限制水域中航行的超大型油轮KVLCC2的操纵运动进行控制研究.为便于LQR控制器的设计,采用线性状态空间形式的操纵运动方程,基于数值模拟获取的相应线性水动力系数,计算出使目标函数值最小的增益矩阵K,从而得到满足最优控制规律的时域舵角变化,实现对不同宽度水域中船舶运动的最优控制,并与极点配置控制法作比较,验证LQR控制器的优越性.结果表明,当船岸距离d/L≥1.2时,船舶基本不受岸壁效应的影响,控制幅度极小;当岸壁距离d/L=0.25时,摆舵角度将超过6°,同时船舶前进速度也将下降,下降幅度将超过前进速度的10%,岸壁效应明显.     

Nonlinear pricing in linear cities with elastic demands

Nonlinear road pricing charges each traveler based on his/her trip’s corresponding particular attribute level. In order to help authorities in designing road pricing systems at a strategic level, this paper attempts to address two fundamental questions: (i) what is the value of pricing’s nonlinearity for mitigating traffic congestion? (ii) if a nonlinear toll function is implemented, should it be convex, concave or other shape? Specifically, we consider distance-based pricing in linear cities. For linear monocentric cities with heterogeneous travelers, we show that the system optimal distance-based pricing indeed exhibits nonlinearity. It is proved that: (i) the cost-based system optimal toll function is monotonically increasing and concave with respect to the traveled distance; (ii) the time-based system optimal toll function always exists and is unique. If the initial proportion of each traveler group is invariant along a corridor and the demand function is of exponential type, then the time-based system optimal toll function enables the travelers, living further away from a city center, to face a lower toll level per unit distance. For a linear polycentric city, we demonstrate: (i) there always exists the system optimal differentiated (in terms of city centers) toll functions; (ii) it is highly possible that the system optimal non-differentiated toll function does not exist. Hence, we further propose an optimal toll design model, prove the Lipschitz continuity of its objective and adopt a global-optimization algorithm to solve it.